Advanced Peer Clustering and Firework Query Model in the Peer-to-Peer Network

نویسندگان

  • Cheuk Hang Ng
  • Ka Cheung Sia
  • Chi-Hang Chan
چکیده

Clustering technique is used in database and information retrieval system for organizing data and improving retrieval efficiency. We surmise such functionality is valuable to a Peer-to-Peer (P2P) distributed environment. In this paper, we introduce the concept of peer clustering at the level of overlaying network topology, thus, data inside the P2P network are organized in a fashion similar to a Yellow Pages. Moreover, the usability of these systems depends on effective techniques to retrieve information, however, the current strategies used in existing P2P systems are inefficient. To avoid query messages flooding and saving resources in handling irrelevant queries, we propose a content-based query routing strategy, the Firework Query Model, to improve existing retrieval methods. In contrast to broadcasting the query message, our query message is routed intelligently according to its content. Once it reaches the target cluster, the query message is broadcasted to all peers inside the cluster much like an exploding firework. We design and implement a DIStributed COntent-based Visual Information Retrieval (DISCOVIR) system with content-based query functionality and improved query efficiency. We demonstrate its scalability and efficiency through simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Peer Clustering and Firework Query Model

In this paper, we present a new strategy for information retrieval over the peer-to-peer (P2P) network. To avoid query messages flooding and saving resources in handling irrelevant queries in the P2P network, we propose a method for clustering peers that share similar properties together, thus, data inside the P2P network will be organized in a fashion similar to a Yellow Pages. In order to mak...

متن کامل

A Novel Strategy for Information Retrieval in the Peer-to-Peer Network

In this paper, we present a new strategy for information retrieval over peer-to-peer (P2P) network. The usability of these P2P information sharing systems depends on effective techniques to retrieve information; however, the current strategies used in existing P2P systems are inefficient. To avoid query messages flooding and saving resources in handling irrelevant queries in P2P network, we pro...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Rater Errors among Peer-Assessors: Applying the Many-Facet Rasch Measurement Model

In this study, the researcher used the many-facet Rasch measurement model (MFRM) to detect two pervasive rater errors among peer-assessors rating EFL essays. The researcher also compared the ratings of peer-assessors to those of teacher assessors to gain a clearer understanding of the ratings of peer-assessors. To that end, the researcher used a fully crossed design in which all peer-assessors ...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003